Decomposing plane cubic graphs
نویسندگان
چکیده
منابع مشابه
Decomposing plane cubic graphs
It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. We prove the conjecture for 3-connected cubic plane graphs and 3-connected cubic graphs on the projective plane. Our proof provides a polynomial time algorithm to find the decomposition for 3-connected cubic plane graphs.
متن کاملRainbowness of cubic plane graphs
The rainbowness, rb(G), of a connected plane graph G is the minimum number k such that any colouring of vertices of the graph G using at least k colours involves a face all vertices of which receive distinct colours. For a connected cubic plane graph G we prove that n 2 + ∗1 − 1 rb(G) n− ∗0 + 1, where ∗0 and ∗1 denote the independence number and the edge independence number, respectively, of th...
متن کاملPositively curved cubic plane graphs are finite
Let G be an infinite plane graph such that G is locally finite and every face of G is bounded by a cycle. Then G is said to be positively curved if, for every vertex x of G, 1− d(x)/2 + Σx∈F 1 |F | > 0, where the summation is taken over all facial cycles F containing x. Note that if G is positively curved then the maximum degree of G is at most 5. As a discrete analogue of a result in Riemannia...
متن کاملDecomposing Cubic Graphs into Connected Subgraphs of Size Three
Let S = {K1,3,K3, P4} be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph G into graphs taken from any non-empty S′ ⊆ S. The problem is known to be NP-complete for any possible choice of S′ in general graphs. In this paper, we assume that the input graph is cubic, and study the computational complexity of the problem of partitioning its edge se...
متن کاملMinimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs
A convex drawing of a plane graph G is a plane drawing of G, where each vertex is drawn as a point, each edge is drawn as a straight line segment and each face is drawn as a convex polygon. A maximal segment is a drawing of a maximal set of edges that form a straight line segment. A minimum-segment convex drawing of G is a convex drawing of G where the number of maximal segments is the minimum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.08.005